Hypergraph-Based Source Codes for Function Computation Under Maximal Distortion

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

Hypergraph Codes

An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes

We consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the l-descriptions problem was the Combinatorial Message Sharing with Binning (CMSB) region. The CMSB scheme utilizes unstructured quantizers and unstructured binnin...

Distributed Source Coding for Interactive Function Computation

In networked systems where distributed inferencing and control needs to be performed, the raw-data generated at different nodes needs to be transformed and combined in a number of ways to extract actionable information. This requires performing distributed computations on the rawdata. A pure data-transfer solution approach would advocate first reliably reproducing the rawdata at decision-making...

HiBISCuS: Hypergraph-Based Source Selection for SPARQL Endpoint Federation

Efficient federated query processing is of significant importance to tame the large amount of data available on the Web of Data. Previous works have focused on generating optimized query execution plans for fast result retrieval. However, devising source selection approaches beyond triple pattern-wise source selection has not received much attention. This work presents HiBISCuS, a novel hypergr...